Circulants , Linear Recurrences and Codes
نویسندگان
چکیده
We shall give some intriguing applications of the theory of circulants—the circulant matrices—and that of linear recurrence sequences (LRS). The applications of the former in §2 ranges from a simple derivation of the Blahut theorem to the energy levels of hydrogen atoms in circular hydrocarbons, where the Blahut theorem is to the effect that the Hamming weight of a code is equal to the rank of the associated Fourier matrix. The latter in §3 is connected to the understanding of an LFSR (linear feedback shift register) as an LRS, and culminates to a corollary asserting that the linear complexity of the periodically repeated sequence is equal to the rank of the DFT matrix, revealing the relationship between Blahut’s and Massey’s formulations. At the end of §3 we give a proof of Blahut’s theorem by Massey’s theorem. We also mention other relevance of circulants to the hydrocarbons and class numbers of cyclotomic fields in §4. This constitutes a companion paper to [8] and deals with more concrete cases.
منابع مشابه
Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes
This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in const...
متن کاملRAPPORT Primes in the doubly stochastic circulants
The algebraic structure of the set of doubly stochastic circulants is that of a semi-ring. The concept of a prime in the doubly stochastic circulants is introduced in this paper and examples are given. The classiication of a prime in the doubly stochastic circulants is equivalent to the solvability of a linear equation over a doubly stochastic circulant. A representation of doubly stochastic ci...
متن کاملCodes Closed under Arbitrary Abelian Group of Permutations
Algebraic structure of codes over Fq , closed under arbitrary abelian group G of permutations with exponent relatively prime to q, called G-invariant codes, is investigated using a transform domain approach. In particular, this general approach unveils algebraic structure of quasicyclic codes, abelian codes, cyclic codes, and quasi-abelian codes with restriction on G to appropriate special case...
متن کاملA circulant approach to skew-constacyclic codes
We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x; θ] modulo the left ideal generated by a polynomial of the type x − a. This allows us to develop an approach to skew-constacyclic codes based on such circulants. Properties of these circulants are derived, and in particular it is shown that the transpose of a certain circulant is a circulant again. This rec...
متن کاملA Circulant Preconditioner for the Systems of LMF-Based ODE Codes
In this paper, a recently introduced block circulant preconditioner for the linear systems of the codes for ordinary differential equations (ODEs) is investigated. Most ODE codes based on implicit formulas, at each integration step, need the solution of one or more unsymmetric linear systems that are often large and sparse. Here, the boundary value methods, a class of implicit methods for the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013